Congestion Games with Capacitated Resources
نویسندگان
چکیده
منابع مشابه
Atomic Congestion Games with Taxes on Resources
Introduction We consider the following network problem: there are finite number of users in the network. Each user has a non-negligible (or atomic) amount of demand and wants to route her demand from her source to her sink through multiple paths. For each edge in the network, there exists congestion for per unit of flow, which depends on the total amount of flow on this edge. The cost of a user...
متن کاملNash Dynamics in Congestion Games with Similar Resources
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a polynomial factor at every congestion level. We show that for any ε > 0, an ε-Nash dynamics in symmetric congestion games with similar resources converge in steps polynomial in 1/ε and the number of players are resourc...
متن کاملCongestion Games with Multisets of Resources and Applications in Synthesis
In classical congestion games, players’ strategies are subsets of resources. We introduce and study multiset congestion games, where players’ strategies are multisets of resources. Thus, in each strategy a player may need to use each resource a different number of times, and his cost for using the resource depends on the load that he and the other players generate on the resource. Beyond the th...
متن کاملCongestion Games with Complementarities
We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study Lp norms and analyze ...
متن کاملCapacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodeson a network making strategic choices regarding the content to replicate in their caches. Caching gameswere introduced by Chun et al [6], who analyzed the uncapacitated case leaving the capacitated version asan open direction.In this work, we study pure Nash equilibria of both frac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9541-0